//...
#include <cstdio>
#include <cstring>
int n, a[18], s[18][2], i, j, sum;

void process(){
	memset(s, 0, sizeof(s));
	s[0][0]=1;
	if(a[0]>0)
	sum=0;
}

int main(){
	
	while(scanf("%d", &n)==1){
		for(i=0;i<n;++i)scanf("%d", &a[i]);
		process();
		printf("Case #%d: The maximum product is %d.\n", sum);
	}
	return 0;
}
	